Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication

نویسندگان

  • Sean Ballentine
  • Aurore Guillevic
  • Elisa Lorenzo García
  • Chloe Martindale
  • Maike Massierer
  • Benjamin Smith
  • Jaap Top
چکیده

Schoof’s classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations of modular polynomials, and by Elkies, using a theory of explicit isogenies. Moving to Jacobians of genus-2 curves, the current state of the art for point counting is a generalization of Schoof’s algorithm. While we are currently missing the tools we need to generalize Elkies’ methods to genus 2, recently Martindale and Milio have computed analogues of modular polynomials for genus-2 curves whose Jacobians have real multiplication by maximal orders of small discriminant. In this article, we prove Atkin-style results for genus-2 Jacobians with real multiplication Sean Ballentine Department of Mathematics, University of Maryland, 4176 Campus Dr., College Park, MD 207424015, USA e-mail: [email protected] Aurore Guillevic Inria Nancy Grand Est, Equipe Caramba, 615 rue du jardin botanique, CS 20101, 54603 Villers-lèsNancy Cedex, France e-mail: [email protected] Elisa Lorenzo Garcı́a IRMAR, Université de Rennes 1, Campus de Beaulieu, 35042 Rennes Cedex, France e-mail: [email protected] Chloe Martindale Mathematisch Instituut, Universiteit Leiden, P.O. Box 9512, 2300 RA Leiden, The Netherlands e-mail: [email protected] Maike Massierer School of Mathematics and Statistics, University of New South Wales, Sydney NSW 2052, Australia e-mail: [email protected] Benjamin Smith INRIA and Laboratoire d’Informatique de l’École polytechnique (LIX), 91120 Palaiseau, France e-mail: [email protected] Jaap Top University of Groningen, Johann Bernoulli Institute for Mathematics and Computer Science, P.O. Box 407, 9700AK Groningen, The Netherlands e-mail: [email protected] 1 ar X iv :1 70 1. 01 92 7v 2 [ m at h. N T ] 1 9 A pr 2 01 7 by maximal orders, with a view to using these new modular polynomials to improve the practicality of point-counting algorithms for these curves.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Aspects of Jacobians of Hyperelliptic Curves

Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest of which remains the Pollard rho algorithm with r-adding walks. For the first time, we rigorously analyze the Pollard rho method with r-addin...

متن کامل

Families of Hyperelliptic Curves with Real Multiplication Familles de courbes hyperelliptiques à multiplications réelles

where bxc denotes the integer part of x. We say that a curve C of genus bn/2c, defined over a field k, has real multiplication by Gn if there exists a correspondence C on C such that Gn is the characteristic polynomial of the endomorphism induced by C on the regular differentials on C . The endomorphism ring of the Jacobian JC of such a curve C contains a subring isomorphic to Z[X ]/(Gn(X )) wh...

متن کامل

Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves

We describe the use of explicit isogenies to reduce Discrete Logarithm Problems (DLPs) on Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, which are vulnerable to faster index calculus attacks. We provide algorithms which compute an isogeny with kernel isomorphic to (Z/2Z) for any hyperelliptic genus 3 curve. These algorithms provide a rational isogeny...

متن کامل

Families of Explicit Isogenies of Hyperelliptic Jacobians

We construct three-dimensional families of hyperelliptic curves of genus 6, 12, and 14, two-dimensional families of hyperelliptic curves of genus 3, 6, 7, 10, 20, and 30, and one-dimensional families of hyperelliptic curves of genus 5, 10 and 15, all of which are equipped with an an explicit isogeny from their Jacobian to another hyperelliptic Jacobian. We show that the Jacobians are genericall...

متن کامل

Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms

As Koblitz curves were generalized to hyperelliptic Koblitz curves for faster point multiplication by Günter,et al [10], we extend the recent work of Gallant,et al [8] to hyperelliptic curves. So the extended method for speeding point multiplication applies to a much larger family of hyperelliptic curves over finite fields that have efficiently-computable endomorphisms. For this special family ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1701.01927  شماره 

صفحات  -

تاریخ انتشار 2017